منابع مشابه
A blow-up construction and graph coloring
In this note we construct a non-singular algebraic variety VG encoding the incidence information of a simple graph G, by a sequence of blow-ups of a projective space along suitable linear subspaces. The aim is to translate into the geometry of VG the combinatorial information about G; we nd that this can be done with surprising ease and e ciency. For example, we prove that the chromatic polynom...
متن کاملTesting Graph Blow-Up
Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Sp...
متن کاملSpeeding up Parallel Graph Coloring
This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph coloring algorithm and suggest several enhancements both in terms of ordering the vertices so as to minimize cache misses, and performing vertex-to-processor assignments based on graph partitioning instead of random allocation. ...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولA subexponential construction of graph coloring for multiparty computation
We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box nonAbelian groups which is both optimal (secure against an adversary who possesses any t < n2 inputs) and has subexponential complexity of construction based on coloring of planar graphs. More specifically, following the result of Desmed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00051-j